dft matrix造句

• A consequence of the circular convolution theorem is that the DFT matrix diagonalizes any circulant matrix.
• Each row or column of the DFT matrix provides an orthogonal CI spreading code which spreads a data symbol.
• The multidimensional DFT matrix, in turn, is disintegrated into a set of factors, called functional primitives, which are individually identified with an underlying software / hardware computational design.
• A commonly known special Vandermonde matrix is the discrete Fourier transform matrix ( DFT matrix ), where the numbers ? " i " are chosen to be the " m " different " m " th roots of unity.
• Spreading is achieved by multiplying a vector of data symbols by the DFT matrix to produce a vector of coded data symbols, then each coded data symbol is mapped to an OFDM subcarrier via an input bin of an inverse fast Fourier transform ( IFFT ).
• The choice of eigenvectors of the DFT matrix has become important in recent years in order to define a discrete analogue of the fractional Fourier transform the DFT matrix can be taken to fractional powers by exponentiating the eigenvalues ( e . g ., Rubio and Santhanam, 2005 ).
• The choice of eigenvectors of the DFT matrix has become important in recent years in order to define a discrete analogue of the fractional Fourier transform the DFT matrix can be taken to fractional powers by exponentiating the eigenvalues ( e . g ., Rubio and Santhanam, 2005 ).